On some promise classes in structural complexity theory

نویسنده

  • Jörg Rothe
چکیده

To my parents iv Acknowledgments Professor Gerd Wechsung, my advisor, has been the most influential and decisive person regarding my scientific career. He not only nurtured my pleasure in mathematics when I was an undergraduate student but also introduced me to the joy and challenge of doing research. I very much appreciate his inspiring and enthusiastic way of creating and formalizing ideas and his graceful style of holding lectures as well as his humane warmth, grace, and optimism. I am particularly grateful to him for bringing about my collaboration with Professor Lane Hemaspaandra and, in general, for his constant encouragement and support. I am very grateful to Professor Lane Hemaspaandra for his kind guidance, insightful advice, and seminal collaboration during my one year stay at the University of Rochester and ever since. His scientific enthusiasm and his flood of wonderful ideas, comments, and suggestions that contributed to the research described in this work have been invaluable for this thesis and, in fact, made it possible at all. Particularly, I am much indebted to him for having me take part in, and contribute to, his research projects, which eventually led to the first three sections of Chapter 3 and to Chapter 5 of this thesis. From him I learned that striking out in new directions from the solid foundation of being well versed in one's field, combined with the American virtue, speed in getting done whatever one aims at, is the most crucial prerequisite for successful work. In addition, I thank him for his financial support that allowed me to present the results contained in the fourth section of Chapter 3 at the Acknowledgments Jena for our wonderful collaboration in many projects and for their generous permission to present the results of our joint papers in this thesis. In particular, I'd like to mention that Osamu Watanabe's idea of looking at Buhrman, E. Hemaspaandra, and Longpré's tally encoding of sparse sets ignited the research described in Chapter 4 of this thesis, and I again have to thank Lane Hemaspaandra for proposing the investigation of the upward separation technique regarding promise classes. I also thank Arfst Nickelsen and Johannes Köbler for their permission to state and cite still unpublished results of theirs in this work. Furthermore, I thank all my current and former colleagues, Gerhard Lischke, Jörg Vogel (who was supervising my diploma thesis in 1991), In particular, I'd like to express …

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Predicate classes, promise classe, and the acceptance power of regular languages

It contributes some results to Structural Complexity Theory which is a subfield of Theoretical Computer Science. First of all I have to thank my advisor Prof. Klaus Ambos-Spies for his continuing guidance and support. He also gave several crucial hints for the results of this thesis.

متن کامل

An Unambiguous Class Possessing a Complete Set Topics : Computational and Structural Complexity Theory

In this work a complete problem for an unambiguous logspace class is presented. This is surprising since unambiguity is a `promise' or`semantic' concept. These usually lead to classes apparently without complete problems.

متن کامل

Uniform Diagonalization Theorem for Complexity Classes of Promise Problems including Randomized and Quantum Classes

Diagonalization in the spirit of Cantor’s diagonal arguments is a widely used tool in theoretical computer sciences to obtain structural results about computational problems and complexity classes by indirect proofs. The Uniform Diagonalization Theorem allows the construction of problems outside complexity classes while still being reducible to a specific decision problem. This paper provides a...

متن کامل

Recognizability versus solvability of promise problems in finite, classical and quantum automata, framework

In pioneering papers [13, 17], the concept of the promise problems was introduced and started to be systematically explored. It has been argued that promise problems should be seen as partial decision problems and as such that they are more fundamental than decision problems and formal languages that used to be considered as the basic ones for complexity theory issues explorations. Moreover, bo...

متن کامل

Upward Separation for FewP and Related Classes

This paper studies the range of application of the upward separation technique that has been introduced by Hartmanis to relate certain structural properties of polynomial-time complexity classes to their exponential-time analogs and was rst applied to NP [Har83]. Later work revealed the limitations of the technique and identi ed classes defying upward separation. In particular, it is known that...

متن کامل

Uniformly Defining Complexity Classes of Functions

We introduce a general framework for the definition of function classes. Our model, which is based on polynomial time nondeterministic Turing transducers, allows uniform characterizations of FP, FPNP, counting classes (# P, # NP, # coNP, GapP, GapPNP), optimization classes (max P, min P, max NP, min NP), promise classes (NPSV, #few P, c# P), multivalued classes (FewFP, NPMV) and many more. Each...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995